Combinatorial and algorithmic aspects of networking (Third workshop, CAAN 2006, Chester, UK, July 2, 2006)Erlebach, Thomas.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-48822-7, 1 vol.(VIII-134 p.), isbn 3-540-48822-7Conference Proceedings

The European Symposium on Algorithms (ESA 2006)AZAR, Yossi; ERLEBACH, Thomas.Algorithmica. 2009, Vol 53, Num 4, issn 0178-4617, 166 p.Conference Proceedings

Routing to reduce the cost of wavelength conversionERLEBACH, Thomas; STEFANAKOS, Stamatis.Discrete applied mathematics. 2008, Vol 156, Num 15, pp 2911-2923, issn 0166-218X, 13 p.Article

Conversion of coloring algorithms into maximum weight independent set algorithmsERLEBACH, Thomas; JANSEN, Klaus.Discrete applied mathematics. 2005, Vol 148, Num 1, pp 107-125, issn 0166-218X, 19 p.Article

The maximum edge-disjoint paths problem in bidirected treesERLEBACH, Thomas; JANSEN, Klaus.SIAM journal on discrete mathematics (Print). 2001, Vol 14, Num 3, pp 326-355, issn 0895-4801Article

The complexity of path coloring and call schedulingERLEBACH, Thomas; JANSEN, Klaus.Theoretical computer science. 2001, Vol 255, Num 1-2, pp 33-50, issn 0304-3975Article

Recent Advances on Approximation Algorithms for Minimum Energy Range Assignment Problems in Ad-Hoc Wireless NetworksPELEG, David.Lecture notes in computer science. 2006, pp 1-4, issn 0302-9743, isbn 3-540-48822-7, 4 p.Conference Paper

Approximation and online algorithms (Third international workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005)Erlebach, Thomas; Persinao, Giuseppe.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-32207-8, 1Vol, X-347 p, isbn 3-540-32207-8Conference Proceedings

Algorithms (ESA 2006)Azar, Yossi; Erlebach, Thomas.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-38875-3, 1Vol, XVIII-843 p, isbn 3-540-38875-3Conference Proceedings

Lower and Upper Bounds on FIFO Buffer Management in QoS SwitchesENGLERT, Matthias; WESTERMANN, Matthias.Algorithmica. 2009, Vol 53, Num 4, pp 523-548, issn 0178-4617, 26 p.Conference Paper

On shortest-path all-optical networks without wavelength conversion requirementsERLEBACH, Thomas; STEFANAKOS, Stamatis.Lecture notes in computer science. 2003, pp 133-144, issn 0302-9743, isbn 3-540-00623-0, 12 p.Conference Paper

New results for path problems in generalized stars, complete graphs, and brick wall graphsERLEBACH, Thomas; VUKADINOVIC, Danica.Lecture notes in computer science. 2001, pp 483-494, issn 0302-9743, isbn 3-540-42487-3Conference Paper

Routing in all-optical ring networks revisitedSTEFANAKOS, Stamatis; ERLEBACH, Thomas.IEEE symposium on computers communications. 2004, isbn 0-7803-8623-X, 2Vol, vol1, 288-293Conference Paper

Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphsAMBUHL, Christoph; ERLEBACH, Thomas; MIHAL'AK, Matus et al.Lecture notes in computer science. 2006, pp 3-15, issn 0302-9743, isbn 3-540-38044-2, 1Vol, 13 p.Conference Paper

Optimal bandwidth reservation in hose-model VPNs with multi-path routingERLEBACH, Thomas; RIIEGG, Maurice.IEEE INFOCOM. 2004, pp 2275-2282, isbn 0-7803-8355-9, 8 p.Conference Paper

ONLINE CAPACITATED INTERVAL COLORINGEPSTEIN, Leah; ERLEBACH, Thomas; LEVIN, Asaf et al.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 2, pp 822-841, issn 0895-4801, 20 p.Article

Variable Sized Online Interval Coloring with BandwidthEPSTEIN, Leah; ERLEBACH, Thomas; LEVIN, Asaf et al.Algorithmica. 2009, Vol 53, Num 3, pp 385-401, issn 0178-4617, 17 p.Article

Path problems in generalized stars, complete graphs, and brick wall graphsERLEBACH, Thomas; VUKADINOVIC, Danica.Discrete applied mathematics. 2006, Vol 154, Num 4, pp 673-683, issn 0166-218X, 11 p.Conference Paper

Polynomial-time approximation schemes for geometric intersection graphsERLEBACH, Thomas; JANSEN, Klaus; SEIDEL, Eike et al.SIAM journal on computing (Print). 2005, Vol 34, Num 6, pp 1302-1323, issn 0097-5397, 22 p.Article

Approximation algorithms and complexity results for path problems in trees of ringsERLEBACH, Thomas.Lecture notes in computer science. 2001, pp 351-362, issn 0302-9743, isbn 3-540-42496-2Conference Paper

Parallel load balancing for problems with good bisectorsBISCHOF, Stefan; EBNER, Ralf; ERLEBACH, Thomas et al.Journal of parallel and distributed computing (Print). 2000, Vol 60, Num 9, pp 1047-1073, issn 0743-7315Article

Hierarchical Sampling from Sketches: Estimating Functions over Data StreamsGANGULY, Sumit; BHUVANAGIRI, Lakshminath.Algorithmica. 2009, Vol 53, Num 4, pp 549-582, issn 0178-4617, 34 p.Conference Paper

Single Machine Precedence Constrained Scheduling Is a Vertex Cover ProblemAMBÜHL, Christoph; MASTROLILLI, Monaldo.Algorithmica. 2009, Vol 53, Num 4, pp 488-503, issn 0178-4617, 16 p.Conference Paper

Approximation algorithms for edge-disjoint paths and unsplittable flowERLEBACH, Thomas.Efficient approximation and online algorithms (recent progress on classical combinatorial optimization problems and new applications). Lecture notes in computer science. 2006, pp 97-134, issn 0302-9743, isbn 3-540-32212-4, 1Vol, 38 p.Book Chapter

Interval selection: Applications, algorithms, and lower boundsERLEBACH, Thomas; SPIEKSMA, Frits C. R.Journal of algorithms (Print). 2003, Vol 46, Num 1, pp 27-53, issn 0196-6774, 27 p.Article